Finite Automata Presentable Abelian Groups

نویسندگان

André Nies

Pavel Semukhin

چکیده

We give new examples of FA presentable torsion-free abelian groups. Namely, for every n > 2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group (Z,+) in which every nontrivial cyclic subgroup is not FA recognizable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FA-presentable Groups and Rings

We consider structures which are FA-presentable. It is known that an FA-presentable finitely generated group is virtually abelian; we strengthen this result by showing that an arbitrary FA-presentable group is locally virtually abelian. As a consequence, we prove that any FA-presentable ring is locally finite; this is a significant restriction and allows us to say a great deal about the structu...

متن کامل

The Accepting Power of Finite Automata over Groups

Some results from [2], [5], [6] are generalized for nite automata over arbitrary groups. The accepting power is smaller when abelian groups are considered, in comparison with the non-abelian groups. We prove that this is due to the commutativity. Each language accepted by a nite automaton over an abelian group is actually a unordered vector language. Finally, deterministic nite automata over gr...

متن کامل

Lattice-ordered abelian groups and perfect MV-algebras: a topos-theoretic perspective

This talk is based on [2]. We establish, generalizing Di Nola and Lettieri’s categorical equivalence [3], a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MValgebras. Further, after observing that the two theories are not bi-interpretable in the classical sense, we identify, by considering appropriate topos-theoretic invariants on their common classi...

متن کامل

CDMTCS Research Report Series Describing Groups

Two ways of describing a group are considered. 1. A group is finiteautomaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order senten...

متن کامل